Using the bipartite line graph to visualize 2-mode social networks

نویسنده

  • Malcolm Alexander
چکیده

This paper surveys the range of techniques available for the analysis of 2-mode (actor-byevent) datasets and proposes an additional option for visualization and analysis that uses the linegraph of the bipartite adjacency matrix. The nodes of this line-graph are roles or statuses conferred on actors through their participation in events or recognition of their group membership. The line-graph can be structured to have two sets of edges. One set of edges shows the connections between actors created by their common participations or group memberships. The second set of edges show which statuses (memberships) in different groups are connected because the same actor holds both. The paper shows how to generate the line graph using UCINET procedures but also assembles 2-mode data to show details in the line graph not readily available through UCINET procedures. Contact: Dr. Malcolm Alexander, School of Arts, Media and Culture, Griffith University, Nathan, Australia. 4111 Tel: 61-7-3875 7169 Fax: 61-7-38757189 Email: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visualizing Bipartite Network Data using SAS® Visualization Tools

Bipartite networks refer to the networks created from affiliation relationships, such as patient-provider relationships in healthcare data. Analyzing such networks allows us to gain additional insights on groups that share the same member and members that belong to the same group. This paper develops methods to visualize bipartite network data in healthcare using the Annotate facility. Link ana...

متن کامل

A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...

متن کامل

Exploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications

In this article, we extend several algebraic graph analysis methods to bipartite networks. In various areas of science, engineering and commerce, many types of information can be represented as networks, and thus the discipline of network analysis plays an important role in these domains. A powerful and widespread class of network analysis methods is based on algebraic graph theory, i.e., repre...

متن کامل

The backbone of bipartite projections: Inferring relationships from co-authorship, co-sponsorship, co-attendance and other co-behaviors

The analysis and visualization of weighted networks pose many challenges, which have led to the development of techniques for extracting the network’s backbone, a subgraph composed of only the most significant edges. Weighted edges are particularly common in bipartite projections (e.g. networks of coauthorship, co-attendance, co-sponsorship), which are often used as proxies for one-mode network...

متن کامل

Scaling Collaborative Filtering to Large-Scale Bipartite Rating Graphs Using Lenskit and Spark

Popular social networking applications such as Facebook, Twitter, Friendster, etc. generate very large graphs with different characteristics. These social networks are huge, comprising millions of nodes and edges that push existing graph mining algorithms and architectures to their limits. In product-rating graphs, users connect with each other and rate items in tandem. In such bipartite graphs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005